Control and Management Protocols for Survivable Optical Mesh Networks

نویسندگان

  • Chadi Assi
  • Yinghua Ye
  • Mohamad Ali
چکیده

This paper considers the problem of online provisioning and restoration of sharable, restorable connections in a mesh-based optical network. First, we propose a new framework called distributed path selection with local information (DPLI) and discuss in detail a control and management protocol to set up and tear down connections and determine restoration capacity sharability in a distributed manner. Since only local information is maintained at each node, protocol scalability is not a big concern. Second, we discuss the important problem of the network’s ability to quickly recover from element failures. We propose a new rapid restoration signaling that minimizes the service interruption time upon the occurrence of a failure in a network with preplanned restoration paths. The significant contribution of this new algorithm is that the connection restoration time is found to be independent of the restoration path length (i.e., eliminating the effect of the propagation delay), of the accumulation of the switch configuration time along the restoration path, and of the switch configuration waiting time at any particular node when multiple configuration requests arrive simultaneously. We evaluate through simulation experiments the effectiveness of the proposed protocols.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving signaling recovery in shared mesh optical networks

Current restoration signaling is a two-phase messaging procedure between the sender and the receiver and depends heavily on the message propagation delays during the recovery process and the cross-connect switching times. Offset time (OT) based restoration was proposed in [C. Assi, Y. Ye, S. Dixit, M. Ali. Control and management protocols for survivable optical mesh networks, IEEE Journal of Li...

متن کامل

Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks

In this work we introduce and describe optimal sets of survivable paths defined on an undirected simple graph G. An optimal set of survivable paths in G corresponds to a set of mesh-restored lightpaths in an optical network that minimizes the number of optical channels. We present several fundamental properties of optimal sets of survivable paths in G.

متن کامل

Availability-Guaranteed Service Provisioning Employing a Generalized Path-Protection Model in WDM Networks

Traffic grooming deals with efficiently packing/unpacking low-speed connections onto high-capacity trunks. We examine traffic grooming for optical mesh networks by reviewing grooming-node architectures, traffic models, grooming policies, novel graph models, survivable grooming, and hierarchical switching, etc. @2003 Optical Society of America OCIS codes: (060.4250) Networks; (060.4510) Optical ...

متن کامل

Dynamic Provisioning of Survivable Multicast Sessions in Optical WDM Mesh Networks

We investigate dynamic provisioning of multicast sessions while protecting them against any single fiber cut in optical WDM mesh networks. Our proposed segment-protection and path-pair-protection schemes exhibit very good performance relative to other schemes.

متن کامل

Survivable WDM Mesh Networks

In a wavelength-division-muliplexing (WDM) optical network, the failure of network elements (e.g., fiber links and cross connects) may cause the failure of several optical channels, thereby leading to large data losses. This study examines different approaches to protect a mesh-based WDM optical network from such failures. These approaches are based on two survivability paradigms: 1) path prote...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001